Geometric learning for computational mechanics Part II: Graph embedding for interpretable multiscale plasticity

نویسندگان

چکیده

The history-dependent behaviors of classical plasticity models are often driven by internal variables evolved according to phenomenological laws. difficulty interpret how these represent a history deformation, the lack direct measurement for calibration and validation, weak physical underpinning those laws have long been criticized as barriers creating realistic models. In this work, geometric machine learning on graph data (e.g. finite element solutions) is used means establish connection between nonlinear dimensional reduction techniques Geometric learning-based encoding graphs allows embedding rich time-history onto low-dimensional Euclidean space such that evolution plastic deformation can be predicted in embedded feature space. A corresponding decoder then convert back into weighted dominating topological features observed analyzed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Active Learning for Graph Embedding

Graph embedding provides an ecient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information. In contrast to the graph structure data, the i.i.d. node embeddings can be processed eciently in terms of both time and space. Current semi-supervised graph embedding algorithms assume the labelled nodes are given, which may not be alwa...

متن کامل

The Complexity of Simultaneous Geometric Graph Embedding

Given a collection of planar graphs G1, . . . , Gk on the same set V of n vertices, the simultaneous geometric embedding (with mapping) problem, or simply k-SGE, is to find a set P of n points in the plane and a bijection φ : V → P such that the induced straight-line drawings of G1, . . . , Gk under φ are all plane. This problem is polynomial-time equivalent to weak rectilinear realizability of...

متن کامل

Knowledge Semantic Representation: A Generative Model for Interpretable Knowledge Graph Embedding

Knowledge representation is a critical topic in AI, and currently embedding as a key branch of knowledge representation takes the numerical form of entities and relations to joint the statistical models. However, most embedding methods merely concentrate on the triple fitting and ignore the explicit semantic expression, leading to an uninterpretable representation form. Thus, traditional embedd...

متن کامل

Geometric algebra: a computational framework for geometrical applications (part II: applications)

Geometric algebra is a consistent computational framework in which to define geometric primitives and their relationships. This algebraic approach contains all geometric operators and permits coordinate-free specification of computational constructions. It contains primitives of any dimensionality (rather than just vectors). This second paper on the subject uses the basic products to represent ...

متن کامل

Learning and memory, part II: molecular mechanisms of synaptic plasticity.

Learning and Memory, Part I, described how shortterm memories are consolidated into long-term memories and the brain regions involved in this process. As previously discussed, the hippocampus is required for the formation of declarative memories (conscious memories of events and facts). This type of memory was destroyed in the famous clinical case of H.M. after he sustained a bilateral hippocam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering

سال: 2023

ISSN: ['0045-7825', '1879-2138']

DOI: https://doi.org/10.1016/j.cma.2022.115768